COMPOSING HYBRID DISCRETE EVENT SYSTEM AND CELLULAR AUTOMATA MODELS by
نویسندگان
چکیده
Hybrid system models — those devised from two or more disparate sub-system models — provide a number of benefits in terms of conceptualization, development, and assessment of dynamical systems. The decomposition approach helps to formulate complex interactions that are otherwise difficult or impractical to express. However, hybrid model development and usage can introduce complexity that emerges from the composition itself. To improve assurance of model correctness, sub-systems using disparate modeling formalisms must be integrated above and beyond just the data and control level; their composition must have model specification and simulation execution aspects as well. Poly-formalism composition is one approach to composing models in this manner. This dissertation describes a poly-formalism composition between a Discrete EVent System specification (DEVS) model and a Cellular Automata (CA) model types. These model specifications have been chosen for their broad applicability in important and emerging domains. An agent-environment domain exemplifies the composition approach. The inherent spatial relations within a CA make it well-suited for environmental representations. Similarly, the component-based nature of agents fits well within the hierarchical component structure of DEVS. This composition employs the use of a third model, called an interaction model, that includes methods for integrating the two model types at a formalism level, at a systems architecture level, and at a model execution level. A prototype framework using DEVS for the agent model and GRASS for the environment has been developed and is described. Furthermore, this dissertation explains how the concepts of this composition approach are being applied to a real-world research project. This dissertation expands the tool set modelers in computer science and other disciplines have in order to build hybrid system models, and provides an interaction model for an
منابع مشابه
Compositions of (max, +) automata
Abstract: Automata with weights (multiplicities) in the so called (max,+) semiring constitute a class of timed automata. Their modeling power has been studied in Gaubert and Mairesse (1999): at least timed safe Petri nets can be modeled by means of (max,+) automata. In this contribution, we define compositions for (max,+) automata. The motivation is to be able to model a complex system by compo...
متن کاملDynamic Structure Cellular Automata in a Fire Spreading Application
Studying complex propagation phenomena is usually performed through cellular simulation models. Usually cellular models are specific cellular automata developed by non-computer specialists. We attempt to present here a mathematical specification of a new kind of CA. The latter allows to soundly specify cellular models using a discrete time base, avoiding basic CA limitations (infinite lattice, ...
متن کاملThe cellular automata formalism and its relationship to DEVS
Cellular automata (CA) were originally conceived by Ulam and von Neumann in the 1940s to provide a formal framework for investigating the behaviour of complex, spatially distributed systems. Cellular Automata constitute a dynamic, discrete space, discrete time formalism where space is usually discretized in a grid of cells. Cellular automata are still used to study, from first principles, the b...
متن کاملThe Theory of Hybrid Automata
A hybrid automaton is a formalmodel for a mixed discrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classi cation reveals structure on mixed discrete-continuous state spaces that was previously studied on purely discrete state spaces only. In particular, various classes of hybrid automata induce nitary tra...
متن کاملModelling excitable cells using cycle-linear hybrid automata.
Cycle-linear hybrid automata (CLHAs), a new model of excitable cells that efficiently and accurately captures action-potential morphology and other typical excitable-cell characteristics such as refractoriness and restitution, is introduced. Hybrid automata combine discrete transition graphs with continuous dynamics and emerge in a natural way during the (piecewise) approximation process of any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009